Benders Decomposition for the Hop-Constrained Survivable Network Design Problem
نویسندگان
چکیده
منابع مشابه
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem
Given a graph with nonnegative edge weights and node pairs Q, we study the problem of constructing a minimum weight set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L edges between each pair in Q. Using the layered representation introduced by Gouveia (1998), we present a formulation for the problem valid for any K, L ! 1. We use a Benders dec...
متن کاملBenders decomposition for the hop-constrainted survivable network design problem
survivable network design problem Quentin Botton Center for Supply Chain Managemqent (CESCM), Louvain School of Management, Université catholique de Louvain, Louvain-la-Neuve, Belgium, and CORE, Université catholique de Louvain, Louvain-la-Neuve, Belgium, [email protected] Bernard Fortz GOM, Department of Computer Science, Faculté des Sciences, Université Libre de Bruxelles, Brussels,...
متن کاملTwo node-disjoint hop-constrained survivable network design and polyhedra
Given a weighted undirected graphGwith a set of pairs of terminals {si, ti}, i = 1, ..., d, and an integer L ≥ 2, the two node-disjoint hop-constrained survivable network design problem (TNHNDP) is to find a minimum weight subgraph of G such that between every si and ti there exist at least two node-disjoint paths of length at most L. This problem has applications to the design of survivable te...
متن کاملOn the hop-constrained survivable network design problem with reliable edges
In this paper, we study the hop-constrained survivable network design problemwith reliable edges. Given a graph with non-negative edge costs and node pairs Q, the hop-constrained survivable network design problem consists of constructing a minimum cost set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L edges between each pair in Q. In addition...
متن کاملReliable Network Design Problem under Node Failure with Benders Decomposition
The design of telecommunication network with capacity constraints of links, routers and ports of routers is considered in this paper. Specially, we limit each demand flow traversed through a pre-specified maximal number of links (called hops) under node failure scenarios in IP layer network. Such a design must be the most cost-effective and ensure that feasible flows continue to exist even when...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2013
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.1110.0472